Width two posets are reconstructible

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small graphs are reconstructible

With the help of a novel computational technique, we show that graphs with up to 11 vertices are determined uniquely by their sets of vertex-deleted subgraphs, even if the set of subgraphs is reduced by isomorphism type. The same result holds for triangle-free graphs to 14 vertices, square-free graphs to 15 vertices and bipartite graphs to 15 vertices, as well as some other classes.

متن کامل

Totally Symmetric Functions are Reconstructible from Identification Minors

We formulate a reconstruction problem for functions of several arguments: Is a function of several arguments uniquely determined, up to equivalence, by its identification minors? We establish some positive and negative results on this reconstruction problem. In particular, we show that totally symmetric functions (of sufficiently large arity) are reconstructible.

متن کامل

Labeled posets are universal

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorphicity orders of k-posets and k-lattices are shown to be universal in the sense that every countable poset can be embedded into them. Labeled posets are represented by directed graphs, and a categorical isomorphism betw...

متن کامل

The centroidal branches of a separable graph are edge reconstructible

If T is a tree, then the weight of a vertex v in T is the number of vertices in a largest component of T − v. The centroid of a tree is the set of vertices of minimum weight. We show that if G is a separable graph then there is a unique block or cutvertex that contains the centroids of all spanning trees of G. We define this block or cutvertex to be the centroid of G. We show that the centroid ...

متن کامل

Finite Subsets of the Plane are 18-Reconstructible

We prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning the reconstructibility of infinite subsets of the plane.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1996

ISSN: 0012-365X

DOI: 10.1016/0012-365x(95)00295-8